Enumerating Justifications using Resolution

نویسندگان

  • Yevgeny Kazakov
  • Peter Skocovsky
چکیده

We propose a new procedure that can enumerate justifications of a logical entailment given a set of inferences using which this entailment can be derived from axioms in the ontology. The procedure is based on the extension of the resolution method with so-called answer literals. In comparison to other (SAT-based) methods for enumerating justifications, our procedure can enumerate justifications in any user-defined order that extends the subset relation. The procedure is easy to implement and can be parametrized with ordering and selection strategies used in resolution. We describe an implementation of the procedure provided in PULi—a new Java-based Proof Utility Library, and provide an empirical comparison of (several strategies of) our procedure and other SAT-based tools on popular EL ontologies. The experiments show that our procedure provides a comparable, if not better performance than those highly optimized tools. For example, using one of the strategies, we were able to compute all justifications for all direct subsumptions of Snomed CT in about 1.5 hour. No other tool used in our experiments was able to do it even within a much longer period.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Can one do good medical ethics without principles?

The criteria for determining what it is to do good medical ethics are the quality of ethical analysis and ethical justifications for decisions and actions. Justifications for decisions and actions rely on ethical principles, be they the 'famous four' or subsidiary ethical principles relevant to specific contexts. Examples from clinical ethics, research ethics and public health ethics reveal tha...

متن کامل

Model Based Critique of Justifications for Action

Justifications for actions can typically be critiqued on a number of grounds. Critiques of such justifications can be structured using an argumentation scheme for practical reasoning and associated critical questions. The form that the critiques can take in a computational system, however, depends crucially on the semantic underpinnings of the scheme. We describe a semantic model which, we argu...

متن کامل

Framing QA as Building and Ranking Intersentence Answer Justifications

We propose a question answering (QA) approach that both identifies correct answers and produces compelling human-readable justifications for why those answers are correct. Our method first identifies the actual information need in a question using psycholinguistic concreteness norms, then uses this information need to construct answer justifications by aggregating multiple sentences from differ...

متن کامل

A Possibilistic Assumption-Based Truth Maintenance System with Uncertain Justifications, and its Application to Belief Revision

possibilistic model, both changes of weights or labels lead to almost no more computations than in De Kleer's original model. Lastly, the other models cannot handle disjunctions of assumptions ; besides, Provan's model needs to consider the assumptions as independent as long as they are not mutually exclusive (i.e. not containing any nogood). Possibilistic ATMS do not require this assumption, a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017